The curse of the first-in-first-out queue discipline
نویسندگان
چکیده
Every day people face waiting time in queues when going to the grocery store, checking in at the airport or leaving the stadium parking lot after a sports event. Often the facility where they are waiting for service will open at a specific time, and the agents will most likely be serviced in order of arrival using the first-in-first-out (FIFO) queue discipline. In this paper we consider a game in which agents choose their arrival time to a service facility where they can line up only after a given point in time. We show that in terms of equilibrium expected utility, the first-in-firstout queue discipline has inferior welfare properties in this model. In fact, in Nash equilibrium the first-in-first-out queue discipline is the worst in terms of utility and welfare among all work-conserving stochastic queue disciplines, while the last-infirst-out (LIFO) discipline comes off best. JEL codes: C72, D62, R41
منابع مشابه
Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملA Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملOptimal Control of Service Rate in a Service Center with Lapse (Research Note)
The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process with lapse. It is assumed that the service discipline is FCFS (first come, first served), arrival process is Poisson, service time distribution is exponential, service process is one phase and the capacity is infinite. It is also assumed that the customer may...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 104 شماره
صفحات -
تاریخ انتشار 2017